Commitment scheme

Results: 216



#Item
91Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Juan A. Garay∗ Daniel Wichs†

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Juan A. Garay∗ Daniel Wichs†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-04-15 13:34:55
92Encrypting Proofs on Pairings and Its Application to Anonymity for Signatures Georg Fuchsbauer David Pointcheval

Encrypting Proofs on Pairings and Its Application to Anonymity for Signatures Georg Fuchsbauer David Pointcheval

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-12-17 12:32:39
93Precise Concurrent Zero Knowledge Omkant Pandey∗ Rafael Pass†  Amit Sahai∗

Precise Concurrent Zero Knowledge Omkant Pandey∗ Rafael Pass† Amit Sahai∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-02-01 05:01:22
94Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications Yunlei Zhao‡ Abstract In this work, we investigate concurrent knowledge-extraction (CKE) and concurrent n

Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications Yunlei Zhao‡ Abstract In this work, we investigate concurrent knowledge-extraction (CKE) and concurrent n

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2007-03-07 05:44:25
95Chapter 1 Introduction Historically, cryptography arose as a means to enable parties to maintain privacy of the information they send to each other, even in the presence of an adversary with access to the communication c

Chapter 1 Introduction Historically, cryptography arose as a means to enable parties to maintain privacy of the information they send to each other, even in the presence of an adversary with access to the communication c

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2009-09-20 20:40:23
96On definitions of selective opening security Florian B¨ohl∗, Dennis Hofheinz†, and Daniel Kraschewski Karlsruhe Institute of Technology {Florian.Boehl,Dennis.Hofheinz,Daniel.Kraschewski}@kit.edu October 29, 2013

On definitions of selective opening security Florian B¨ohl∗, Dennis Hofheinz†, and Daniel Kraschewski Karlsruhe Institute of Technology {Florian.Boehl,Dennis.Hofheinz,Daniel.Kraschewski}@kit.edu October 29, 2013

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-10-29 07:48:46
97On the Amortized Complexity of Zero-knowledge Protocols Ronald Cramer? , Ivan Damg˚ ard?? , and Marcel Keller? ? ? CWI/Leiden University, Aarhus University, and University of Bristol  Abstract. We propose a general tech

On the Amortized Complexity of Zero-knowledge Protocols Ronald Cramer? , Ivan Damg˚ ard?? , and Marcel Keller? ? ? CWI/Leiden University, Aarhus University, and University of Bristol Abstract. We propose a general tech

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-05-09 09:29:46
98The proceedings version of this paper appears in ACM CCSThis is the full version of that paper.  Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗

The proceedings version of this paper appears in ACM CCSThis is the full version of that paper. Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2007-08-20 03:48:31
99A Note on Constant-Round Zero-Knowledge Proofs of Knowledge∗ Yehuda Lindell† September 24, 2012 Abstract In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge∗ Yehuda Lindell† September 24, 2012 Abstract In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-09-24 15:21:39
100Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation Kai-Min Chung∗ Huijia Lin†

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation Kai-Min Chung∗ Huijia Lin†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-12-18 08:37:34